A multiobjective integrated multiproject scheduling and multiskilled workforce assignment model considering learning effect under uncertainty

Today, organizations try to decline academically expenses using humans and resources in addition to rising managers and operators' satisfaction. Meantime, a very important step in the process of decision is the assignment of human resources, particularly in connection with research and development (R&D) projects in which the system is highly dependent on the capabilities of human resources. In this study, we tried all the assumptions that come true in the real world, considered a model for applied R&D projects to reduce costs and increase the efficiency of projects. Therefore, an integrated multiproject scheduling and multiskill human resource assignment model under uncertainty has developed for R&D projects. Furthermore, it is assumed that the activity processing time is related to human resources assignment that means the learning effect is considered. To demonstrate the proposed model efficiency, the various dimensions instance problem was solved accurately and efficiently in GAMS software, and the results have been reported. In addition, the proposed model is validated through the input parameter sensitivity analysis. The results indicate a suitable performance of the proposed fuzzy mathematical programming model is due to the complexity of the problem.     

A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility

The traditional flexible job shop scheduling problem (FJSP) considers machine flexibility but not worker flexibility. Given the influence and potential of human factors in improving production efficiency and decreasing the cost in practical production systems, we propose a mathematical model of an extended FJSP with worker flexibility (FJSPW). A hybrid artificial bee colony algorithm (HABCA) is presented to solve the proposed FJSPW. For the HABCA, effective encoding, decoding, crossover and mutation operators are designed, and a new effective local search method is developed to improve the speed and exploitation ability of the algorithm. The Taguchi method of Design of Experiments is used to obtain the best combination of key parameters of the HABCA. Extensive computational experiments carried out to compare the HABCA with some well-performing algorithms from the literature confirm that the proposed HABCA is more effective than these algorithms, especially on large-scale FJSPW instances.     

Blockchain-oriented dynamic modelling of smart contract design and execution in the supply chain

Recently, the applications of Blockchain technology have begun to revolutionise different aspects of supply chain (SC) management. Among others, Blockchain is a platform to execute the smart contracts in the SC as transactions. We develop and test a new model for smart contract design in the SC with multiple logistics service providers and show that this problem can be presented as a multi-processor flexible flow shop scheduling. A distinctive feature of our approach is that the execution of physical operations is modelled inside the start and completion of cyber information services. We name this modelling concept ‘virtual operation’. The constructed model and the developed experimental environment constitute an event-driven dynamic approach to task and service composition when designing the smart contract. Our approach is also of value when considering the contract execution stage. The use of state control variables in our model allows for operations status updates in the Blockchain that in turn, feeds automated information feedbacks, disruption detection and control of contract execution. The latter launches the re-scheduling procedure, comprehensively combining planning and adaptation decisions within a unified methodological framework of dynamic control theory. The modelling complex developed can be used to design and control smart contracts in the SC.     

模型驱动的大数据流水线框架PiFlow

复杂流程的大数据处理多依托于流水线系统，但大数据处理的流水线系统在易用性、功能复用性、扩展性以及处理性能等方面存在不足。针对上述问题，为提高大数据处理环境的构建与开发效率,优化处理流程，提出了一种模型驱动的大数据流水线框架PiFlow。首先，将大数据处理过程抽象为有向无环图；然后，开发一系列组件用于构建数据处理流水线，并设计了流水线任务执行机制。同时，为规范和简化流水线框架的描述，设计了基于模型驱动的大数据流水线描述语言——PiFlowDL，该语言以模块化、层次化的方式对大数据处理任务进行描述。PiFlow以所见即所得(WYSIWYG)的方式配置流水线，集成了状态监控、模板配置、组件集成等功能，与Apache NiFi相比有2~7倍的性能提升。     

Cross-regional integrated energy system scheduling optimization model considering conditional value at risk

Integrated energy system is a very important way to improve energy efficiency. Based on the combined heating cooling and power system, combined with energy storage equipment, a cross-regional integrated energy system scheduling optimization problem is studied. An integrated energy system scheduling optimization model is established that meets the requirements of electrical, heating, and cooling load under a variety of energy sources while both considering the interaction of electrical, heating, and cooling load between regions, and complementation of them within one region. Meanwhile, the value at risk (VaR) theory is introduced and the operating constraints of equipment in the integrated energy system fully considered, the integrated energy system scheduling model with VaR is established. The example shows that the model can realize multi-type electrical, heating, and cooling load optimized by schedule across regions under the premise of satisfying the balance of energy supply and demand, which can reduce the system operation cost. The sensitivity analysis of the minimum expected cost and the influencing factors of conditional VaR is carried out to verify the validity and feasibility of the proposed model.

• An integrated energy system scheduling optimization model is established that meets the requirements of electrical, heating, and cooling load under a variety of energy sources while both considering the interaction of electrical, heating, and cooling load between regions, and complementation of them within one region.
• By using the conditional value at risk theory to consider various types of the integrated energy system complements and evaluates the operational risk of the system under optimal operating conditions of the system.
• The total cost of system scheduling operation is proportional to the storage capacity, which is inversely proportional to the heat storage capacity and inversely proportional to the pipeline capacity within a certain interval.

     

Effect of storage options on price-based scheduling for a hybrid trigeneration system

Trigeneration is efficient to supply cooling, heat, and power demands. Also, hydro (pumped) storage with zero fuel costs can increase profit when price-based scheduling problem is solved. The goal of this study is to investigate the effects of electric boiler, hydro storage, and heat storage tank on price-based scheduling problem for hybrid trigeneration (trigeneration-conventional-gas boiler) system. A heuristic algorithm is applied to a power system where in validation case, total cost reduction of 0.63% to 0.91% is reached as compared with reported in literature. The results show that the utilization of electric boiler, hydro storage, and heat storage tank leads to profit improvement by 4.58%. Also, a critical sensitivity analysis is conducted and the results show the significant effects of several factors on scheduling results.     

Application of Hyper-Spherical Search algorithm for optimal energy resources dispatch in residential microgrids

This paper presents a residential hybrid thermal/electrical grid-connected home energy system (HES), including a fuel-cell with combined heat and power and a battery-based energy storage system. The minimum operation cost of this integrated energy system is achieved by proper scheduling of different energy resources, found by applying a new powerful optimization algorithm, the Hyper-Spherical Search (HSS) algorithm, to the system's scheduling problem. This is the first time that HSS is used to face the energy resource dispatch problem. The HSS has been only tested in mathematical problems in the previous study. The optimization procedure generates an efficient look-up table in which the powers generated by different energy resources are determined for all time intervals. The effect of different electricity tariffs for purchasing electricity from the main grid on the operation costs of the system is investigated. Moreover, a battery is properly dispatched in the energy system to decrease the operation costs. A real load demand is used in the simulation. The results of HSS are compared with the harmony search algorithm and the colonial competitive algorithm to show the power and effectiveness of HSS to find the optimal dispatch strategy of energy resources for the first time. This is the first time that HSS is compared with CCA. The results of this paper are expected to contribute to home energy systems and real projects.     

A tabu search algorithm for the multi-period inspector scheduling problem

This paper introduces a multi-period inspector scheduling problem (MPISP), which is a new variant of the multi-trip vehicle routing problem with time windows (VRPTW). In the MPISP, each inspector is scheduled to perform a route in a given multi-period planning horizon. At the end of each period, each inspector is not required to return to the depot but has to stay at one of the vertices for recuperation. If the remaining time of the current period is insufficient for an inspector to travel from his/her current vertex A to a certain vertex B, he/she can choose either waiting at vertex A until the start of the next period or traveling to a vertex C that is closer to vertex B. Therefore, the shortest transit time between any vertex pair is affected by the length of the period and the departure time. We first describe an approach of computing the shortest transit time between any pair of vertices with an arbitrary departure time. To solve the MPISP, we then propose several local search operators adapted from classical operators for the VRPTW and integrate them into a tabu search framework. In addition, we present a constrained knapsack model that is able to produce an upper bound for the problem. Finally, we evaluate the effectiveness of our algorithm with extensive experiments based on a set of test instances. Our computational results indicate that our approach generates high-quality solutions.     

An Ant Colony Algorithm (ACA) for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs

This paper concerns with the Job Shop Scheduling Problem (JSSP) considering the transportation times of the jobs from one machine to another. The goal of a basic JSSP is to determine starting and ending times for each job in which the objective function can be optimized. In here, several Automated Guided Vehicles (AGVs) have been employed to transfer the jobs between machines and warehouse located at the production environment. Unlike the advantages of implemented automatic transportation system, if they are not controlled along the routes, it is possible that the production system encounters breakdown. Therefore, the Conflict-Free Routing Problem (CFRP) for AGVs is considered as well as the basic JSSP. Hence, we proposed a mathematical model which is composed of JSSP and CFRP, simultaneously and since the problem under study is NP-hard, a two stage Ant Colony Algorithm (ACA) is also proposed. The objective function is to minimize the total completion time (make-span). Eventually, in order to show the model and algorithm’s efficiency, the computational results of 13 test problems and sensitivity analysis are exhibited. The obtained results show that ACA is an efficient meta-heuristic for this problem, especially for the large-sized problems. In addition, the optimal number of both AGVs and rail-ways in the production environment is determined by economic analysis.     

Resource-constrained scheduling with optional recycling operations

This paper introduces a scheduling problem with a variant of resource constraint that stems from a relocation project. We also propose the concept of optional recycling operations, in which recycling operations are separated from the processing of jobs and recycling operations are exercised only when necessary. An integer program is proposed to formulate the problem and facilitate complexity classification. We propose a pseudo-polynomial time dynamic program, and then classify the complexity status of several restricted cases.